Due Date Single Machine Scheduling Problems with Nonlinear Deterioration and Learning Effects and Past Sequence Dependent Setup Times
نویسندگان
چکیده
منابع مشابه
Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...
متن کاملSingle-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis V. Mani, Pei-Chann Chang* and Shih-Hsin Chen Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India; Department of Information Management, Yuan Ze University, 135, Yuan-Dong Road, Tao-Yuan 320, Taiwan, R.O.C.; Department of Electronic Commerce Management, Na...
متن کاملTwo meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning
This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...
متن کاملSingle-machine scheduling against due dates with past-sequence-dependent setup times
Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In...
متن کاملSingle Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Setup Time and Position-Dependent Processing Time
This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/682738